منابع مشابه
Boolean Ring Satisfiability
We propose a method for testing satisfiability based on Boolean rings. It makes heavy use of simplification, but avoids the potential size increase associated with application of the distributive law by employing a combined linear and binomial representation. Several complexity results suggest why the method may be relatively effective in many cases. The framework is also amenable to learning f...
متن کاملSymmetry in Boolean Satisfiability
This paper reviews recent approaches on how to accelerate Boolean Satisfiability (SAT) search by exploiting symmetries in the problem space. SAT search algorithms traverse an exponentially large search space looking for an assignment that satisfies a set of constraints. The presence of symmetries in the search space induces equivalence classes on the set of truth assignments. The goal is to use...
متن کاملConnectivity of Boolean satisfiability
In this thesis we are concerned with the solution-space structure of Boolean satisfiability problems, from the view of theoretical computer science, especially complexity theory. We consider the solution graph of Boolean formulas; this is the graph where the vertices are the solutions of the formula, and two solutions are connected iff they differ in the assignment of exactly one variable. For ...
متن کاملFault Tolerant Boolean Satisfiability
A δ-model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yielding a new satisfying assignment. These satisfying assignments represent robust solutions to optimization problems (e.g., scheduling) where it is possible to recover from unforeseen events (e.g., a resource becoming...
متن کاملGeneralizing Boolean Satisfiability II: Theory
This is the second of three planned papers describing zap, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high performance solvers. The fundamental idea underlying zap is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal is to def...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 2014
ISSN: 0001-0782,1557-7317
DOI: 10.1145/2578043